#include <bits/stdc++.h>
using namespace std;
const int maxn=2e5+10;
int main()
{
	long long n,a,b;
	cin >> n >> a >> b;
	long long d[maxn];
	long long val;
	long long mind=1e10;
	long long maxd=-1e10;
	long long distant=-1e10;
	long long temp;
	for(long long i=1;i<=n;i++)
	{
		cin >> val;
		d[i]=val%(a+b);
	}
    sort(d+1,d+n+1);
    mind=d[1];
    maxd=d[n];
    for(int i=2;i<=n;i++)
    {
    	distant=max(distant,d[i]-d[i-1]);
	}
	if(maxd-mind<=a-1)
	{
		cout << "Yes" << endl;
	}
	else if(distant>=b+1)
	{
		cout << "Yes" << endl;
	}
	else
	{
		cout << "No" << endl;
	}
	return 0;
}
